Simulation Analysis of Multiple BP Decoding Algorithm and FFT-BP Decoding Algorithm
نویسندگان
چکیده
منابع مشابه
Simulation Analysis of Multiple BP Decoding Algorithm and FFT-BP Decoding Algorithm
In order to solve the problem that the original decoding algorithm of multi-band LDPC codes is high and is not conducive to hardware implementation, two simplified decoding algorithms for multi-band LDPC codes are studied: the reliability propagation based on fast Fourier transform Code algorithm (FFT-BP) and log-BP decoding algorithm based on logarithmic operations. The simulation results show...
متن کاملBP-LED decoding algorithm for LDPC codes over AWGN channels
A new method for low-complexity near-maximum-likelihood (ML) decoding of low-density parity-check (LDPC) codes over the additive white Gaussian noise channel is presented. The proposed method termed beliefpropagation–list erasure decoding (BP-LED) is based on erasing carefully chosen unreliable bits performed in case of BP decoding failure. A strategy of introducing erasures into the received v...
متن کاملFEC & Turbo Code Decoding Using BP Algorithm in LTE and WiMAX Systems
Some wireless message systems such as IS54, improved data rates for the GSM evolution (EDGE), universal interoperability for microwave access (WiMAX) and long term evolution (LTE) have adopted low-density parity-check (LDPC), tail-biting convolutional, and turbo codes as the forward error correcting codes (FEC) scheme for data and overhead channels. Therefore, many efficient algorithms have bee...
متن کاملA Method for Grouping Symbol Nodes of Group Shuffled BP Decoding Algorithm
In this paper, we propose a method for enhancing performance of a sequential version of the belief-propagation (BP) decoding algorithm, the group shuffled BP decoding algorithm for low-density paritycheck (LDPC) codes. An improved BP decoding algorithm, called the shuffled BP decoding algorithm, decodes each symbol node in serial at each iteration. To reduce the decoding delay of the shuffled B...
متن کاملThe asymptotic error floor of LDPC ensembles under BP decoding
We consider communication over binary memoryless symmetric channels using random elements from irregular low density parity check code (LDPC) ensembles, and belief propagation (BP) decoding. Under the assumption that the corresponding Tanner graph includes a non-vanishing fraction of degree 2 variable nodes, we determine the large blocklength behavior of the bit error rate for noise levels belo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Communications, Network and System Sciences
سال: 2017
ISSN: 1913-3715,1913-3723
DOI: 10.4236/ijcns.2017.108b027